-
1 loopless path
Техника: маршрут без циклов -
2 loopless path
English-Russian dictionary of telecommunications and their abbreviations > loopless path
-
3 shortest loopless path
Техника: наикратчайший маршрут без цикловУниверсальный англо-русский словарь > shortest loopless path
-
4 shortless loopless path
Телекоммуникации: кратчайший маршрут без обходных путейУниверсальный англо-русский словарь > shortless loopless path
-
5 shortless loopless path
English-Russian dictionary of telecommunications and their abbreviations > shortless loopless path
-
6 path
1) путь2) канал, тракт3) цепь•- alternate path
- antenna-feeder path
- audio-frequency path
- baseband transmission path
- best redundant path
- cable path
- capacitive-coupling path
- closed path
- communication path
- conductive path
- conductor path
- control path
- coupling path
- coverage path
- digital radio path
- diver communication path
- electron-beam path
- feedback path
- feeder radio path
- flow transmitting path
- forward interaction path
- forward path
- holding path
- inductive coupling path
- intermediate point-to-intermediate point path
- interphase path
- junction path
- line-of-sight path
- loopless path
- managing station-to-intermediate point path
- network path
- nonlocked path
- optical path
- phone path
- pregroup path
- radiated path
- radio path
- ray path
- receiving path
- return interactive path
- setup path
- shortless loopless path
- signal path
- sneak path
- speech path
- standard path
- submarine cable path
- tape path
- telephone-to-telephone path
- tested path
- transfer path
- transmitting path
- video-frequency path
- voice-frequency path
- voltage pathEnglish-Russian dictionary of telecommunications and their abbreviations > path
См. также в других словарях:
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Digraph (mathematics) — A directed graph or digraph G is an ordered pair G := (V, A) with * V is a set, whose elements are called vertices or nodes, * A is a set of ordered pairs of vertices, called directed edges, arcs, or arrows.It differs from an ordinary, undirected … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia